Disease outbreak detection through clique covering on a weighted ICPC-coded graph

نویسندگان

  • Klaske van Vuurden
  • Gunnar Hartvigsen
  • Johan Gustav Bellika
چکیده

Even after a decade of increased research into the problem of detecting disease outbreaks, we lack a system that can limit the number of patients affected by a potential epidemic by recognising its existence at an early stage. In this paper we suggest the use of a weighted graph representing symptoms with an exceptionally high prevalence. Cliques with high weighted edges in such a graph will represent groups of symptoms that occur together more often than usual. As a result each clique will represent the main symptoms of a disease with a high incidence rate. This will make it easier to diagnose the nature of an outbreak, to reach the affected patients at an early stage and to distinguish between outbreaks occurring simultaneously.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity Results on Graphs with Few Cliques

A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection representation that satisfies the Helly property. On any such class of graphs some problems that are NP-complete on general graphs, such as the maximum...

متن کامل

Primal-dual approximation algorithms for a packing-covering pair of problems

We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimum clique cover in an interval graph. The problem pair involves weights and capacities; we consider the case of unit weights and the case of unit ca...

متن کامل

Clique-detection models in computational biochemistry and genomics

Many important problems arising in computational biochemistry and genomics have been formulated in terms of underlying combinatorial optimization models. In particular, a number have been formulated as clique-detection models. The proposed article includes an introduction to the underlying biochemistry and genomic aspects of the problems as well as to the graph-theoretic aspects of the solution...

متن کامل

Optimal Multi-Sensor Based Multi Target Detection by Moving Sensors to the Maximal Clique in a Covering Graph

Different methodologies have been employed to solve the multi-sensor multi-target detection problem in a variety of scenarios. In this paper, we devise a time-step optimal algorithm for this problem when all but a few parameters of the sensor/target system are unknown. Using the concept of covering graph, we find an optimum solution for a single sensor, which is extended to multiple sensors by ...

متن کامل

Clique Coverings of Glued Graphs at Complete Clones

A clique covering of a graph G is a set of cliques of G in which each edge of G is contained in at least one clique. The smallest cardinality of clique coverings of G is called the clique covering number of G. A glued graph results from combining two nontrivial vertex-disjoint graphs by identifying nontrivial connected isomorphic subgraphs of both graphs. Such subgraphs are referred to as the c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Studies in health technology and informatics

دوره 136  شماره 

صفحات  -

تاریخ انتشار 2008